Lattices, whose incomparability graphs have horns
نویسندگان
چکیده
منابع مشابه
Rank One Lattices Whose Parabolic Isometries Have No Rotational Part
We prove a result on certain finite index subgroups of rank one lattices which is motivated by cusp closing constructions. Let X always denote a rank one symmetric space of non-compact type, i.e., X is the hyperbolic space KH, n ≥ 2, where K is either R,C,H or O and n = 2 in the latter case. By Σ we always denote a lattice in the isometry group Iso(X), that is, a discrete subgroup of the isomet...
متن کاملCover-Incomparability Graphs of Posets
∗Work supported by the Ministry of Science of Slovenia and by the Ministry of Science and Technology of India under the bilateral India-Slovenia grants BI-IN/06-07-002 and DST/INT/SLOV-P03/05, respectively.
متن کاملGraphs whose flow polynomials have only integral roots
We show if the flow polynomial of a bridgeless graph G has only integral roots, then G is the dual graph to a planar chordal graph. We also show that for 3-connected cubic graphs, the same conclusion holds under the weaker hypothesis that it has only real flow roots. Expressed in the language of matroid theory, this result says that the cographic matroids with only integral characteristic roots...
متن کاملAsymmetric Coloring Games on Incomparability Graphs
Consider the following game on a graph G: Alice and Bob take turns coloring the vertices of G properly from a fixed set of colors; Alice wins when the entire graph has been colored, while Bob wins when some uncolored vertices have been left. The game chromatic number of G is the minimum number of colors that allows Alice to win the game. The game Grundy number of G is defined similarly except t...
متن کاملSome Families of Graphs whose Domination Polynomials are Unimodal
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2013
ISSN: 1570-8667
DOI: 10.1016/j.jda.2013.07.001